Branch and bound

Results: 97



#Item
41

PDF Document

Add to Reading List

Source URL: www.ieor.berkeley.edu

Language: English - Date: 2014-05-28 11:56:44
42The integration of interior-point methods, decomposition concepts and branch-and-bound to solve large scale MIPs Samir Elhedhli Faculty of Management, McGill University 1001 Sherbrooke Street West Montreal, QC, H3A 1G5

The integration of interior-point methods, decomposition concepts and branch-and-bound to solve large scale MIPs Samir Elhedhli Faculty of Management, McGill University 1001 Sherbrooke Street West Montreal, QC, H3A 1G5

Add to Reading List

Source URL: www.cors.ca

Language: English - Date: 2014-12-10 12:16:01
43Sampling-based Motion Planning for Robotic Information Gathering Geoffrey A. Hollinger Gaurav S. Sukhatme

Sampling-based Motion Planning for Robotic Information Gathering Geoffrey A. Hollinger Gaurav S. Sukhatme

Add to Reading List

Source URL: robotics.usc.edu

Language: English - Date: 2014-04-15 18:40:18
44Mapping Large Loops with a Single Hand-Held Camera Laura A. Clemente Instituto de Investigaci´on en Ingenier´ıa de Arag´on Universidad de Zaragoza, Spain

Mapping Large Loops with a Single Hand-Held Camera Laura A. Clemente Instituto de Investigaci´on en Ingenier´ıa de Arag´on Universidad de Zaragoza, Spain

Add to Reading List

Source URL: www.doc.ic.ac.uk

Language: English - Date: 2007-06-04 10:57:12
451  Branch and Bound for Informative Path Planning Jonathan Binney and Gaurav S. Sukhatme  Abstract— We present an optimal algorithm for informative

1 Branch and Bound for Informative Path Planning Jonathan Binney and Gaurav S. Sukhatme Abstract— We present an optimal algorithm for informative

Add to Reading List

Source URL: robotics.usc.edu

Language: English - Date: 2013-06-01 19:27:52
46Wireless cities  Branch-and-bound Channel optimization

Wireless cities Branch-and-bound Channel optimization

Add to Reading List

Source URL: keithbriggs.info

Language: English - Date: 2009-04-21 04:39:33
47Branch and Bound Methods  • basic ideas and attributes • unconstrained nonconvex optimization • mixed convex-Boolean optimization

Branch and Bound Methods • basic ideas and attributes • unconstrained nonconvex optimization • mixed convex-Boolean optimization

Add to Reading List

Source URL: www.stanford.edu

Language: English - Date: 2011-04-26 12:54:55
48Branch and Bound in a Data Parallel Setting Extended Abstract Sven-Bodo Scholz Heriot-Watt University [removed]

Branch and Bound in a Data Parallel Setting Extended Abstract Sven-Bodo Scholz Heriot-Watt University [removed]

Add to Reading List

Source URL: ifl2014.github.io

Language: English - Date: 2015-03-04 15:20:42
49Strengthening Landmark Heuristics via Hitting Sets Blai Bonet1 and Malte Helmert2 Abstract. The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heu

Strengthening Landmark Heuristics via Hitting Sets Blai Bonet1 and Malte Helmert2 Abstract. The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heu

Add to Reading List

Source URL: gki.informatik.uni-freiburg.de

Language: English - Date: 2010-05-29 10:18:47
50C:/Documents and Settings/wkmak/Desktop/DropBox/Dropbox/Thesis/main.dvi

C:/Documents and Settings/wkmak/Desktop/DropBox/Dropbox/Thesis/main.dvi

Add to Reading List

Source URL: www.tmak.info

Language: English - Date: 2013-10-06 08:31:17